minimal, vertex minimal and commonality minimal cn-dominating graphs
Authors
abstract
we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.
similar resources
Vertex Minimal and Common Minimal Equitable Dominating Graphs
In this paper we introduce the common minimal equitable and vertex minimal equitable dominating graph and we get characterize the common minimal equitable and vertex minimal equitable dominating graph which are either connected or complete, some new results of these graphs are obtained. Mathematics Subject Classification: 05C70
full textthe common minimal common neighborhood dominating signed graphs
in this paper, we define the common minimal common neighborhooddominating signed graph (or common minimal $cn$-dominating signedgraph) of a given signed graph and offer a structuralcharacterization of common minimal $cn$-dominating signed graphs.in the sequel, we also obtained switching equivalencecharacterization: $overline{sigma} sim cmcn(sigma)$, where$overline{sigma}$ and $cmcn(sigma)$ are ...
full textAll Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
full textMINIMAL AND STATEWISE MINIMAL INTUITIONISTIC GENERAL L-FUZZY AUTOMATA
In this note, by considering the notions of the intuitionistic general L-fuzzy automaton and $(alpha, beta)$-language, we show that for any $(alpha, beta)$-language $mathcal{L}$, there exists a minimal intuitionistic general L-fuzzy automaton recognizing $mathcal{L}$.We prove that the minimal intuitionistic general L-fuzzy automaton is isomorphic with threshold $(alpha,beta)$ to any $(alpha, be...
full textOn vertex neighborhood in minimal imperfect graphs
Lubiw [11] conjectures that in a minimal imperfect Berge graph, the neighborhood graph N (v) of any vertex v must be connected; this conjecture implies a well known Chvátal’s Conjecture [6] which states that N (v) must contain a P4. In this note we will prove an intermediary conjecture for some classes of minimal imperfect graphs. It is well known that a graph is P4-free if, and only if, every ...
full text708 . Vertex Minimal Planar Cyclic Graphs *
Let c (k) (c. (k» be the least number of vertices of a planar (planar connected) graph whose automorphism group is the cyclic group of order k. If k r is odd and if k = PIal. . . p,ar, PI' . . . ,Pr being primes then c (k) = 3 2: Piai and i=l c. (k) ~ c (k) for r ~ 1 while c. (k) = c (k) + 1 for r> 1. It is conjectured that a similar result holds for k even.
full textMy Resources
Save resource for easier access later
Journal title:
transactions on combinatoricsPublisher: university of isfahan
ISSN 2251-8657
volume 1
issue 1 2012
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023